Mathematical Knowledge Management in Theorema
نویسنده
چکیده
We describe tools available and planned in the Theorema system for supporting the key issues of mathematical knowledge management: mathematical knowledge retrieval, mathematical knowledge composition, and the formal training of the users and creators of mathematical knowledge.
منابع مشابه
An Environment for Building Mathematical Knowledge Libraries
In this paper we identify the organizational problems of Mathematical Knowledge Management and describe tools that address one of these problems, namely, the additional annotation of formalized knowledge. We describe, then, how the tools are realized in the frame of the Theorema system.
متن کاملLabel Management in Mathematical Libraries
In this paper we identify the organizational problems of Mathematical Knowledge Management and describe tools that address one of these problems, namely, the management of composite, hierarchical labels for formalized knowledge. We describe how the tools are realized in the frame of the Theorema system. Acknowledgments This work was partially supported by the RISC PhD scholarship program of the...
متن کاملAlgorithm Synthesis by Lazy Thinking: Examples and Implementation in Theorema
Recently, we proposed a systematic method for top-down synthesis and verification of lemmata and algorithms called ”lazy thinking method” as a part of systematic mathematical theory exploration (mathematical knowledge management). The lazy thinking method is characterized: • by using a library of theorem and algorithm schemes • and by using the information contained in failing attempts to prove...
متن کاملAlgorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy
We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathematical software systems. The main points of emphasis are: The use of schemes for bottom-up mathematical invention, the algorithmic generation of conjectures from failing proofs for top-down mathematical invention, and the possi...
متن کاملMathematical Theory Exploration in Theorema: Reduction Rings
In this paper we present the first-ever computer formalization of the theory of Gröbner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the formal verification of all results has already been fully completed by now; this, in particular, includes the generic implementation and correctness proof of Buch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001